Experiments with parallel algorithms for combinatorial problems
نویسندگان
چکیده
منابع مشابه
Experiments with Parallel Algorithms for Combinatorial Problems
In the last decade many models for parallel computation have been proposed and many parallel algorithms have been developed. However, few of these models have been realized and most of these algorithms are supposed to run on idealized, unrealistic parallel machines. The parallel machines constructed so far all use a simple model of parallel computation. Therefore, not every existing parallel ma...
متن کاملOn Parallel Algorithms for Combinatorial Problems
Graphs are the most widely used of all mathematical structures. There is uncountable number of interesting computational problems de ned in terms of graphs. A graph can be seen as a collection of vertices (V ), and a collection of edges (E) joining all or some of the vertices. One is very often interested in nding subsets, either from the set V of vertices or from the set E of edges, which poss...
متن کاملSpace-Efficient Parallel Algorithms for Combinatorial Search Problems
We present space-efficient parallel strategies for two fundamental combinatorial search problems, namely, backtrack search and branch-and-bound, both involving the visit of an n-node tree of height h under the assumption that a node can be accessed only through its father or its children. For both problems we propose efficient algorithms that run on a distributed-memory machine with p processor...
متن کاملParallel Algorithms for Image Processing: Practical Algorithms with Experiments
In this paper we design and analyse parallel algorithms with the goal to get exact bounds on their speed-ups on real machines. For this purpose we employ the BSP* model [3] which is an extension of Valiant’s BSP model [13] and rewards blockwise communication. Further we use Valiant’s notion of c-optimality. Intuitively a c-optimal parallel algorithm for p processors tends to speed-up p=c, where...
متن کاملCombinatorial Algorithms for Parallel Sparse Matrix Distributions
Combinatorial algorithms have long played a crucial enabling role in parallel computing. An important problem in sparse matrix computations is how to distribute the sparse matrix and vectors among processors. We review graph, bipartite graph, and hypergraph models for both 1d (row or column) distributions and 2d distributions. A valuable tool is hypergraph partitioning. We present results using...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 1988
ISSN: 0377-2217
DOI: 10.1016/0377-2217(88)90255-x